Oracle Indistinguishability and its Applications

There are many ‘cascade-type’ constructions in symmetric key cryptography. For these, the output of a PRF (or block cipher) is cascaded to next PRF, and this continues until all blocks given message exhausted. In order prove security these constructions, traditionally multi-oracle families, together with query-based hybrid arguments used, but produce longer proofs which cannot be extended quantum security. paper, we point that oracle indistinguishability, first formalized by Zhandry later Song Yun, useful tool for proving cascade-type both classically quantumly. To illustrate this, using give classical proof NMAC. Also, RC (Randomized Cascade) construction, gives out weak secure,